$4$-Colouring of Generalized Signed Planar Graphs
نویسندگان
چکیده
منابع مشابه
Colouring graphs with bounded generalized colouring number
Given a graph G and a positive integer p, χp(G) is the minimum number of colours needed to colour the vertices of G so that for any i ≤ p, any subgraph H of G of tree-depth i gets at least i colours. This paper proves an upper bound for χp(G) in terms of the k-colouring number colk(G) of G for k = 2p−2. Conversely, for each integer k, we also prove an upper bound for colk(G) in terms of χk+2(G)...
متن کاملHomomorphisms of signed planar graphs
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the definitions of signed homomorphism. In this paper, we introduce and study the properties of some target graphs for signed homomorphism. Using these properties, w...
متن کاملProjective-planar signed graphs and tangled signed graphs
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex is obtained by taking a projective-planar signed graph or a copy of −K5 and then taking 1, 2, and 3-sums with balanced signed graphs.
متن کاملGeneralized circular colouring of graphs
Let P be a graph property and r, s ∈ N, r ≥ s. A strong circular (P , r, s)-colouring of a graph G is an assignment f : V (G) → {0, 1, . . . , r − 1}, such that the edges uv ∈ E(G) satisfying |f(u) − f(v)| < s or |f(u) − f(v)| > r − s, induce a subgraph of G with the propery P . In this paper we present some basic results on strong circular (P , r, s)-colourings. We introduce the strong circula...
متن کاملChoosability in signed planar graphs
This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each k ∈ {3, 4, 5, 6}, every signed planar graph without circuits of length k is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9338